An Approach of Chunk-based Task Runtime Prediction for Self-Scheduling on Multi-core Desk Grid

نویسندگان

  • Peifeng Li
  • Qiaoming Zhu
  • Qin Ji
  • Xiaoxu Zhu
چکیده

Self-Scheduling is a dynamic and adaptive loop scheduling approach to reduce the total execution time for a task running in the cluster or grid environment. This paper focuses on how to use and optimize Self-scheduling technologies to allocate tasks reasonable and achieve better parallel performance. It introduces the prediction algorithms and proposes a novel Chunk-based Task Runtime Prediction (CTRP) algorithm according to the characters of desk grid and multi-core environment. Our experimental results show that our approach can predict the execution time more accurate and achieve better load balancing than that of others when most slave nodes’ load is changing frequently and rulelessly in the multi-core desk grid.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid

Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...

متن کامل

Self-scheduling of EV aggregators in Energy market based on Time-of-Use Pricing

This paper presents a new solution for the self-planning task of private EV aggregators to realize higher profits in distribution networks. Since the model is proposed from the EV aggregator's viewpoint, the corresponding effects of the aggregator's profit-seeking approach on the grid such as the power losses and voltage levels might be unknown or even negative. To address this issue, a commerc...

متن کامل

Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCP

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011